Applying the Mahalanobis-Taguchi System to Vehicle Ride

Authors

  • Elizabeth A. Cudney University of Missouri – Rolla, Rolla, Missouri 65409 USA
  • Kenneth M. Ragsdell University of Missouri – Rolla, Rolla, Missouri 65409 USA
  • Kioumars Paryani Lawrence Technological University, Southfield, Massachusetts 02139 USA
Abstract:

The Mahalanobis Taguchi System is a diagnosis and forecasting method for multivariate data. Mahalanobis distance is a measure based on correlations between the variables and different patterns that can be identified and analyzed with respect to a base or reference group. The Mahalanobis Taguchi System is of interest because of its reported accuracy in forecasting small, correlated data sets. This is the type of data that is encountered with consumer vehicle ratings. MTS enables a reduction in dimensionality and the ability to develop a scale based on MD values. MTS identifies a set of useful variables from the complete data set with equivalent correlation and considerably less time and data. This paper presents the application of the Mahalanobis-Taguchi System and its application to identify a reduced set of useful variables in multidimensional systems.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Identifying Useful Variables for Vehicle Braking Using the Adjoint Matrix Approach to the Mahalanobis-Taguchi System

The Mahalanobis Taguchi System (MTS) is a diagnosis and forecasting method for multivariate data. Mahalanobis distance (MD) is a measure based on correlations between the variables and different patterns that can be identified and analyzed with respect to a base or reference group. MTS is of interest because of its reported accuracy in forecasting small, correlated data sets. This is the type o...

full text

Modeling A Design System Using the Mahalanobis Taguchi System

This work presents a novel algorithm, the MTS algorithm, which offers the Mahalanobis Taguchi System (MTS) method for parameter selections which are adjusted under a product parameter design. The utility of the algorithm is assessed how individual product parameter dimensions are selected and it can be used to focus on design system (DS) and to identify product architecture dimensions that are ...

full text

A Comparison of the Mahalanobis-Taguchi System to A Standard Statistical Method for Defect Detection

The Mahalanobis-Taguchi System is a diagnosis and forecasting method for multivariate data. Mahalanobis distance is a measure based on correlations between the variables and different patterns that can be identified and analyzed with respect to a base or reference group. This paper presents a comparison of the Mahalanobis-Taguchi System and a standard statistical technique for defect detection ...

full text

Optimal Feature Selection of Taguchi Character Recognition in the Mahalanobis-Taguchi System using Bees Algorithm

The Mahalanobis-Taguchi System (MTS) is a data mining method employing Mahalanobis distance (MD) and Taguchi′s Robust Engineering philosophy to explore and exploit data in a multidimensional system. The MD calculation provides a measurement scale to discriminate sample data and gives an approach of measuring the level of severity among them. One unique feature of MTS lies its robustness to asse...

full text

Modified Mahalanobis Taguchi System for Imbalance Data Classification

The Mahalanobis Taguchi System (MTS) is considered one of the most promising binary classification algorithms to handle imbalance data. Unfortunately, MTS lacks a method for determining an efficient threshold for the binary classification. In this paper, a nonlinear optimization model is formulated based on minimizing the distance between MTS Receiver Operating Characteristics (ROC) curve and t...

full text

Binary ant colony optimization applied to variable screening in the Mahalanobis-Taguchi System

This work presents the application of the Mahalanobis–Taguchi System (MTS) to a dimensional problem in the automotive industry. The combinatorial optimization problem of variable selection is solved by the application of a recent version of binary ant colony optimization algorithm. Moreover, a comparison with respect to binary particle swarm optimization algorithm is also presented and a discus...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 1  issue 3

pages  251- 259

publication date 2007-11-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023